Complex roots via real roots and square roots using Routh’s stability criterion
نویسندگان
چکیده
We present a method, based on the Routh stability criterion, for finding the complex roots of polynomials with real coefficients. As in Gauss’s 1815 proof of the Fundamental Theorem of Algebra, we reduce the problem to that of finding real roots and square roots of certain associated polynomials. Unlike Gauss’s proof, our method generates these associated polynomials in an algorithmic way.
منابع مشابه
On finding complex roots of polynomials using the Routh array
We present a method, based on the Routh stability criterion, for transforming the task of finding the complex roots of a polynomial of even degree n with real coefficients to that of: (a) finding their real parts as the n/2 real roots of a polynomial of degree n(n−1)/2; (b) for each real part, calculating the corresponding imaginary part as a square root. We illustrate the method for polynomial...
متن کاملStability of a Two-Sublattice Spin-Glass Model
We study the stability of the replica-symmetric solution of a two-sublattice infinite-range spin-glass model, which can describe the transition from an antiferromagnetic to a spin-glass state. The eigenvalues associated with replica-symmetric perturbations are in general complex. The natural generalization of the usual stability condition is to require the real part of these eigenvalues to be p...
متن کاملHamiltonian Square Roots of Skew-Hamiltonian Matrices
We present a constructive existence proof that every real skew-Hamiltonian matrix W has a real Hamiltonian square root. The key step in this construction shows how one may bring any such W into a real quasi-Jordan canonical form via symplectic similarity. We show further that every W has infinitely many real Hamiltonian square roots, and give a lower bound on the dimension of the set of all suc...
متن کاملRoot Distribution and Stability Analysis of Two Dimensional Linear Discrete Systems Using Sign Criterion with Real Coefficients
A new idea was proposed to find out the stability and root location of two dimensional linear time invariant discrete system (LTIDS) for real coefficient polynomials. For determining stability the sign criterion is synthesized from the jury’s method for stability which is derived from the characteristic polynomial coefficients of the discrete system. The number of roots lying inside or outside ...
متن کاملStability independent of delay using rational functions
This paper is concerned with the problem of assessing the stability of linear systems with a single timedelay. Stability analysis of linear systems with time-delays is complicated by the need to locate the roots of a transcendental characteristic equation. In this paper we show that a linear system with a single time-delay is stable independent of delay if and only if a certain rational functio...
متن کامل